Left-linear Bounded TRSs are Inverse Recognizability Preserving
نویسندگان
چکیده
Bounded rewriting for linear term rewriting systems has been defined in (I. Durand, G. Sénizergues, M. Sylvestre. Termination of linear bounded term rewriting systems. Proceedings of the 21st International Conference on Rewriting Techniques and Applications) as a restriction of the usual notion of rewriting. We extend here this notion to the whole class of left-linear term rewriting systems, and we show that bounded rewriting is effectively inverse-recognizability preserving. The bounded class (BO) is, by definition, the set of left-linear systems for which every derivation can be replaced by a bottom-up derivation. The class BO contains (strictly) several classes of systems which were already known to be inverse-recognizability preserving: the left-linear growing systems, and the inverse right-linear finite-path overlapping systems. 1998 ACM Subject Classification Primary: F.4.2, Secondary: F.3.2, F.4.1
منابع مشابه
Rewriting preserving recognizability of finite tree languages
We show that left-linear generalized semi-monadic TRSs effectively preserving recognizability of finite tree languages (are EPRF-TRSs). We show that reachability, joinability, and local confluence are decidable for EPRFTRSs.
متن کاملLayered Transducing Term Rewriting System and Its Recognizability Preserving Property
A term rewriting system which effectively preserves recognizability (EPR-TRS) has good mathematical properties. In this paper, a new subclass of TRSs, layered transducing TRSs (LT-TRSs) is defined and its recognizability preserving property is discussed. The class of LT-TRSs contains some EPRTRSs, e.g., {f(x) → f(g(x))} which do not belong to any of the known decidable subclasses of EPR-TRSs. B...
متن کاملRight - linear finite path overlapping rewrite systems effectively preserve recognizability ∗
Right-linear finite path overlapping TRS are shown to effectively preserve recognizability. The class of right-linear finite path overlapping TRS properly includes the class of linear generalized semimonadic TRS and the class of inverse left-linear growing TRS, which are known to effectively preserve recognizability.
متن کاملNon - E - overlapping and weakly shallow TRSs are confluent ( Extended abstract ) Masahiko Sakai
Confluence of term rewriting systems (TRSs) is undecidable, even for flat TRSs [MOJ06] or length-two string rewrite systems [SW08]. Two decidable subclasses are known: right-linear and shallow TRSs by tree automata techniques [GT05] and terminating TRSs [KB70]. Most of sufficient conditions are for either terminating TRSs [KB70] (extended to TRSs with relative termination [HA11, KH12]) or leftl...
متن کاملBottom-up rewriting for words and terms
For the whole class of linear term rewriting systems, we define bottomup rewriting which is a restriction of the usual notion of rewriting. We show that bottom-up rewriting effectively inverse-preserves recognizability and analyze the complexity of the underlying construction. The BottomUp class (BU) is, by definition, the set of linear systems for which every derivation can be replaced by a bo...
متن کامل